Traces, Executions and Schedulers, Coalgebraically
نویسندگان
چکیده
A theory of traces of computations has emerged within the field of coalgebra, via finality in Kleisli categories. In concurrency theory, traces are traditionally obtained from executions, by projecting away states. These traces and executions are sequences and will be called “thin”. The coalgebraic approach gives rise to both “thin” and “fat” traces/executions, where in the “fat” case the structure of computations is preserved. This distinction between thin and fat will be introduced first. It is needed for a theory of schedulers in a coalgebraic setting, of which we only present the very basic definitions and results.
منابع مشابه
Probabilistic Timed I/O Automata with Continuous State Spaces
We present Piecewise Deterministic Timed I/O Automata (PDTIOA): a new continuous state automaton model that allows both nondeterministic and probabilistic discrete transitions, along with continuous deterministic trajectories. We use a partition of actions, called tasks and a task scheduler to resolve nondeterministic choice over actions. We define a topology on the set of trajectories and make...
متن کاملWeak Bisimilarity Coalgebraically
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We illustrate the usefulness of our approach by providing a fully-abstract denotational semantics for CCS under weak ...
متن کاملProperty Inference from Program Executions
Software verification techniques require properties that define the intended behavior of a system be specified. Generating such properties is often very difficult and serves as an impediment to the adoption of verification techniques. Techniques that leverage program executions to infer these properties are a promising avenue for automatically generating these properties. In this paper, we prop...
متن کاملCollecting and Querying Distributed Traces of Composite Service Executions
The development of new Web services by composition of existing ones is becoming a widespread approach to realise business-to-business collaborations. The composite services obtained in this way are then eventually used in other compositions. Given the dynamic nature of the Web, this recursive composition of services rapidly leads to intricate dependencies between them. On the other hand, busine...
متن کاملAn evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness
A number of emerging Internet applications such as videoconferencing and live multimedia broadcasts from Internet TV stations will rely on scheduling algorithms in switches and routers to guarantee performance and an acceptable level of quality of service. Fairness in packet schedulers is an intuitively desirable property with practical value; fair schedulers such as Weighted Fair Queueing are ...
متن کامل